modular multiplication造句
例句与造句
- application of montgomery modular multiplication in three factoring algorithm
模乘在3种分解算法中的应用 - modular exponentiation and modular multiplication are the basic algorithms for implementing the public key algorithms such as rsa, etc . however the time-consuming modulo exponentiation computation, which has always been the bottle-neck of rsa, restricts its wider application
大数模幂乘运算是实现rsa等公钥密码的基本运算,该算法存在的问题是在实现时耗时太多,这也是制约其广泛应用的瓶颈。 - a method called montgomery modular multiplication is the most significant way of fast modular multiplication . the montgomery method and its improvements are studied and the performances are analyzed in this thesis
对于加快模乘法速度的方法，本文重点分析peterl.montgomery提出的及其改进算法，介绍和比较了montgomery模乘算法实现上的分类，找出了较为优越的应用于通用处理器上的montgomery模乘算法。 - a method called montgomery modular multiplication is the most significant way of fast modular multiplication . the montgomery method and its improvements are studied and the performances are analyzed in this thesis
对于加快模乘法速度的方法，本文重点分析peterl.montgomery提出的及其改进算法，介绍和比较了montgomery模乘算法实现上的分类，找出了较为优越的应用于通用处理器上的montgomery模乘算法。 - this thesis, focused on the large integer modular computations, studies the two ways to reduce the time consumed by modular exponentiation---algorithms for fast modular multiplication and algorithms for computing powers with the least numbers of modular multiplication
本文对数据加密体制用到的大整数模运算进行研究。我们的工作分为两个部分：一部分是对大整数快速模运算算法的分析、研究；另一部分是大整数快速模运算算法的实现。 - It's difficult to find modular multiplication in a sentence. 用modular multiplication造句挺难的
- this thesis, focused on the large integer modular computations, studies the two ways to reduce the time consumed by modular exponentiation---algorithms for fast modular multiplication and algorithms for computing powers with the least numbers of modular multiplication
本文对数据加密体制用到的大整数模运算进行研究。我们的工作分为两个部分：一部分是对大整数快速模运算算法的分析、研究；另一部分是大整数快速模运算算法的实现。 - fast implementation of the rsa public key algorithms is one of direction of current public key algorithm . the research of this paper has using value, improving the processing of encryption and decryption by fast implementation of modular exponentiation and modular multiplication algorithm
rsa算法的快速实现是现代密码学研究的方向之一,本文研究表明通过改进公钥密码体制中的模幂乘算法,可以进一步提高rsa的效率,具有一定的实用价值。 - montgomery multiplication algorithm is optimized for large-bit modular multiplication and vlsi implementation . it is combined with the r-l right to left binary method to achieve speed improvement . special efforts are focused on the problems with long-bit modular arithmetic
介绍了采用蒙哥马利模乘法算法和指数的从右到左的二进制方法，并根据大整数模乘法运算和vlsi实现的要求进行改进的rsa处理器，在提供高速rsa处理能力的同时，可抵抗某些定时分析攻击和功耗分析攻击。 - the latter pay special attention to the software implementation environments, including the technical details such as programming interface, data structures and 32-bits visual c + + inline assembler . a sorftware packet is designed and implemented at last, which can perform the modular multiplication with equal 2048-bits long of modulu and operands within approximately 5.239ms and the modular exponentiation with equal 2048-bits long of modulu, exponent and base within approximately 4290.559ms
经测试，在intelceleron400mhz，ram64mb的pc机上，进行一次乘数与被乘数的最大位数均为2048位长的模乘运算所需平均时间约为5.239ms，在进行一次底数和指数的最大位数均为2048位长的模指数运算所需的平均时间约为4290.559ms。 - the author mainly realized the method of generating the large random numbers and judging the prime number using lehmann means, then three pairs of secure key with different lengths ( 256 bits, 512 bits, 1024 bits ) was generated to meet the demand of different security grade . in encryption module, modular multiplication arithmetic of large number was realized adopting addition chaining . in decryption module, extended euclid was used to get inverse, and the chinese remainder theorem was used to realize decryption, which increased the speed of decryption greatly
作者主要实现了大随机数的生成、采用整除小素数和勒曼测试法判定素数，可以生成三种不同长度的密钥对(256位、512位、1024位)来满足不同的加密安全等级的需求；加密模块中，选用了二进制序列的乘法方法，实现了大数模幂乘运算；解密模块中，引用了扩展的欧几里德法求逆元，并采用中国剩余定理实现解密过程，大大提高了解密速度。 - this article provides a brief description of rsa public key cryptography, an analysis and compare of all kinds of present existed modular exponentiation in rsa public key cryptography, a colligation of the fastest accelerating software algorithm-vlnw sliding window methods and hardware mapping fast montgomery modular multiplication algorithm that can improve the implementary efficiency of rsa public key cryptography for achieving the novel algorithm-mnexp algorithm
本文简单介绍了rsa公钥密码体制,分析比较rsa公钥密码中已有的模幂运算方法,将得到的最快软件加速算法vlnw滑动窗口法和硬件映射最快的montgomery模乘算法综合,得到改进后的mnexp算法能有效提高rsa公钥密码的实现效率。椭圆曲线密码系统被认为可以替代rsa算法的一种公钥密码体制。 - previous protocols for determining whether a point is inside a circle are not secure enough . we present a two-round protocol for computing the distance between two private points and develop a more efficient protocol for the point-circle inclusion problem based on the distance protocol . in comparison with previous solutions, our protocol not only is more secure but also reduces the number of communication rounds and the number of modular multiplications significantly
保护私有信息的计算几何问题是一类特殊的安全多方计算问题，attalah等首先提出了安全多方计算几何的概念，介绍了点的包含多边形相交判定最近点对及凸包问题，并分别基于茫然传送协议及置换协议设计了两个不同的点积协议，在此基础上提出了解决点在多边形中的包含判定及两个多边形相交判定的初步方法，但正如作者所指出，其方法还不够完善，协议效率有待进一步改进。